// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
struct node
{
	double k,b;
};
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		int n,m=0;
		cin>>n;
		set<pair<double,double>> p;
		for(int i=1;i<=n;i++)
		{
			double x,y;
			cin>>x>>y;
			p.insert({x,y});
		}
		vector<node> a(1e5+10);
		for(auto i:p)
		{
			a[++m]={i.first,i.second};
		}
		int ans=0;
		for(int i=0;i<=m;i++)
		{
			set<pair<double,double>> o;
			for(int j=1;j<i;j++)
			{
				double k1=a[i].k,k2=a[j].k,b1=a[i].b,b2=a[j].b;
				if(k1==k2)continue;
				double x1=(b2-b1)/(k1-k2),y1=k1*x1+b1;
				o.insert({x1,y1});
			}
			ans+=(o.size()+1);
		}
		cout<<ans;
	}
	return 0;
}
